On k-Sets in Four Dimensions

نویسندگان

  • Jǐŕı Matoušek
  • Micha Sharir
  • Shakhar Smorodinsky
  • Uli Wagner
چکیده

We show, with an elementary proof, that the number of halving simplices in a set of n points in R4 in general position is O(n4−2/45). This improves the previous bound of O(n4−1/13 4 ). Our main new ingredient is a bound on the maximum number of halving simplices intersecting a fixed 2-plane.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Bound for k-Sets in Four Dimensions

We show that the number of halving sets of a set of n points in R is O ( n ) , improving the previous bound of [9] with a simpler (albeit similar) proof.

متن کامل

Functionally closed sets and functionally convex sets in real Banach spaces

‎Let $X$ be a real normed  space, then  $C(subseteq X)$  is  functionally  convex  (briefly, $F$-convex), if  $T(C)subseteq Bbb R $ is  convex for all bounded linear transformations $Tin B(X,R)$; and $K(subseteq X)$  is  functionally   closed (briefly, $F$-closed), if  $T(K)subseteq Bbb R $ is  closed  for all bounded linear transformations $Tin B(X,R)$. We improve the    Krein-Milman theorem  ...

متن کامل

Number of Minimal Path Sets in a Consecutive-k-out-of-n: F System

In this paper the combinatorial problem of determining the number of minimal path sets of a consecutive-k-out-of-n: F system is considered. For the cases where k = 2, 3 the explicit formulae are given and for k ≥ 4 a recursive relation is obtained. Direct computation for determining the number of minimal path sets of a consecutive-k-out-of-n: F system for k ≥ 4 remains a difficult task. ...

متن کامل

A convex combinatorial property of compact sets in the plane and its roots in lattice theory

K. Adaricheva and M. Bolat have recently proved that if $,mathcal U_0$ and $,mathcal U_1$ are circles in a triangle with vertices $A_0,A_1,A_2$, then there exist $jin {0,1,2}$ and $kin{0,1}$ such that $,mathcal U_{1-k}$ is included in the convex hull of $,mathcal U_kcup({A_0,A_1, A_2}setminus{A_j})$. One could say disks instead of circles.Here we prove the existence of such a $j$ and $k$ ...

متن کامل

Endpoint bounds for the non-isotropic Falconer distance problem associated with lattice-like sets

Let S ⊂ R be contained in the unit ball. Let ∆(S) = {||a− b|| : a, b ∈ S}, the Euclidean distance set of S. Falconer conjectured that the ∆(S) has positive Lebesque measure if the Hausdorff dimension of S is greater than d 2 . He also produced an example, based on the integer lattice, showing that the exponent d 2 cannot be improved. In this paper we prove the Falconer distance conjecture for t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004